package com.job.Gai_Yian.Homework0720;

import com.job.DQH.dqh720.homework.Count;

import java.util.*;

/**
 * @author Gai_Yian
 * @version 1.0
 * @since 2022-07-21 10:58:28
 */
public class CharCount2_0 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String str = sc.next();
        HashMap<Character,Integer> map = new LinkedHashMap<>();
        for (int i=0;i<=str.length()-1;i++){
            char code=str.charAt(i);
            if (map.containsKey(code)){
                Integer count=map.get(code);
                count+=1;
                map.put(code, count);
            }
            else{
                map.put(code,1);
            }
        }
        Set<Map.Entry<Character,Integer>>entries=map.entrySet();
        for (Map.Entry<Character,Integer>entry:entries){
            Character code=entry.getKey();
            Integer count=entry.getValue();
            System.out.println(code+"一共出现了"+ count +"次");
        }
    }
}
